Two-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n
نویسندگان
چکیده
In this work we study the diameters reduction rate for the iterative application of the longest edge (LE) n-section of triangles for n P 4. The maximum diameter dnk of all triangles generated at the kth iteration of the LE n-section is closely connected with the properties of the triangular mesh generated by this refinement scheme. The upper and the lower bounds for d2k were proved by Kearfott in [9] and for d 3 k by Plaza et al. [12]. Here, we derive the two-sided estimates for dnk with n P 4. 2013 Elsevier Inc. All rights reserved.
منابع مشابه
Convergence of Longest Edge n-Section of Triangles
Let t be a triangle in R. We find the Longest Edge (LE) of t, insert n−1 equally-space points in the LE and connect them to the opposite vertex. This yields the generation of n new sub-triangles whose parent is t. Now, continue this process iteratively. Proficient algorithms for mesh refinement using this method are known when n = 2, but less known when n = 3 and completely unknown when n > 4. ...
متن کاملA new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes
In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.
متن کاملBLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملAlmost Sure Convergence Rates for the Estimation of a Covariance Operator for Negatively Associated Samples
Let {Xn, n >= 1} be a strictly stationary sequence of negatively associated random variables, with common continuous and bounded distribution function F. In this paper, we consider the estimation of the two-dimensional distribution function of (X1,Xk+1) based on histogram type estimators as well as the estimation of the covariance function of the limit empirical process induced by the se...
متن کاملOn the maximum angle condition for the conforming longest-edge n-section algorithm for large values of n
In this note we introduce the conforming longest-edge n-section algorithm and show that for n ≥ 4 it produces a family of triangulations which does not satisfy the maximum angle condition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 224 شماره
صفحات -
تاریخ انتشار 2013